Secure Multiparty Computation between Distrusted Networks Terminals

نویسندگان

  • Sen-Ching S. Cheung
  • Thinh P. Nguyen
چکیده

One of the most important problems facing any distributed application over a heterogeneous network is the protection of private sensitive information in local terminals. A subfield of cryptography called secure multiparty computation (SMC) is the study of such distributed computation protocols that allow distrusted parties to perform joint computation without disclosing private data. SMC is increasingly used in diverse fields from data mining to computer vision. This paper provides a tutorial on SMC for nonexperts in cryptography and surveys some of the latest advances in this exciting area including various schemes for reducing communication and computation complexity of SMC protocols, doubly homomorphic encryption and private information retrieval.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Secure Multiparty Computation for Privacy-Preserving Data Mining

In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient protocols. We also present comm...

متن کامل

Multiparty Computation, an Introduction

These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey some known general results that describe when secure multiparty computation is possible. We then look at some general techniques for building secure multiparty protocols, including protocols for commitment and ...

متن کامل

Secure Multiparty Computation 4.1.1 Overview of Dining Cryptographers (dc) Problem . . . . . . . . . . . 41 List of Figures

Ray Kresman, Advisor Data mining algorithms help reveal hidden information in a repository. Distributed mining algorithms meet this need by distributing data and computation. One of the most important issues of these algorithms is how to safely mine the data. Secure Multiparty Computation (SMC), a framework for safe mining of distributed data, provides some security promises of the computation....

متن کامل

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

We initiate the study of perfectly secure multiparty computation over asynchronous networks tolerating generalized adversaries. The classical results in information-theoretically secure asynchronous multiparty computation among n players state that less than n4 active adversaries can be tolerated in the perfect setting [4]. Strictly generalizing these results to the non-threshold setting, we sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EURASIP J. Information Security

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007